|
課程名稱 |
離散數學
Discrete Mathematics |
|
開課學期 |
111-1 |
|
授課對象 |
電機工程學系 |
|
授課教師 |
江蕙如 |
|
課號 |
EE2008 |
|
課程識別碼 |
901E21100 |
|
班次 |
01 |
|
學分 |
2.0 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期二7,8(14:20~16:20) |
|
上課地點 |
電二144 |
|
備註 |
本課程以英語授課。
總人數上限：40人 |
|
|
|
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. It is the basic language and conceptual foundation of all of computer science. |
|
課程目標 |
Discrete mathematics is the mathematics underlying almost all of computer science. In this course, we will cover the following topics:
1) Logic and Proofs
2) Sets, Functions, and Sequences
3) Growth of functions
4) Basic Number Theory
5) Induction and Recursion
6) Counting
7) Advanced Counting
8) Relations
9) Graphs |
|
課程要求 |
Students are required to preview the course videos and participate in course work. |
|
預期每週課後學習時數 |
2~3 hours |
|
Office Hours |
另約時間 |
|
指定閱讀 |
Kenneth H. Rosen, Discrete Mathematics and Its Applications,
McGraw-Hill. (7th or 8th ed.) |
|
參考書目 |
C. L. Liu, Elements of Discrete Mathematics, 2nd ed., McGraw-Hill, 1998. |
|
評量方式
(僅供參考) |
|
|
針對學生困難提供學生調整方式 |
|
上課形式 |
|
|
作業繳交方式 |
|
|
考試形式 |
|
|
其他 |
由師生雙方議定 |
|
|
週次 |
日期 |
單元主題 |
|
Week 1 |
9/06 |
Introduction |
|
Week 2 |
9/13 |
Logic and Proofs |
|
Week 3 |
9/20 |
Logic and Proofs |
|
Week 4 |
9/27 |
Sets, Functions and Sequences |
|
Week 5 |
10/04 |
Growth of Functions |
|
Week 6 |
10/11 |
Basic Number Theory |
|
Week 7 |
10/18 |
Induction and Recursion |
|
Week 8 |
10/25 |
Midterm |
|
Week 9 |
11/01 |
Counting |
|
Week 10 |
11/08 |
Advanced Counting |
|
Week 11 |
11/15 |
Advanced Counting |
|
Week 12 |
11/22 |
Relations |
|
Week 13 |
11/29 |
Relations |
|
Week 14 |
12/06 |
Graphs |
|
Week 15 |
12/13 |
Graphs |
|
Week 16 |
12/20 |
Final |
|